Statistical metamodeling of dynamic network loading
نویسندگان
چکیده
منابع مشابه
Continuous Dynamic Network Loading Models
The dynamic network equilibrium models have a renewed interest in Europe, Japan and North America. This is due to the design and implementation of Advanced Transport Telematic (ATT) systems require of network models which may evaluate dynamically such actions. The main modeling approaches for the dynamic network equilibrium are: Aggregated macroscopic models in which traffic flows are regarded ...
متن کاملHow network topology affects dynamic loading balancing
The authors compare the perJbrmances of five dynamic loadbalancing strategies. The simulator they ’ue developed lets them measure these performances across a range of network topologies, including a 20 mesh, a 4 0 hypercube, a linear array, and a composite Fibonacci cube. multiprocessor network without load balancing processes processor-generated tasks locally with little or no sharing of compu...
متن کاملA Polymorphic Dynamic Network Loading Model
A polymorphic dynamic network loading (PDNL) model is developed and discretized to integrate a variety of macroscopic traffic flow and node models. The polymorphism, realized through a general node-link interface and proper discretization, offers several prominent advantages. First of all, PDNL allows road facilities in the same network to be represented by different traffic flow models based o...
متن کاملStatistical Metamodeling for Revealing Synergistic Antimicrobial Interactions
Many bacterial pathogens are becoming drug resistant faster than we can develop new antimicrobials. To address this threat in public health, a metamodel antimicrobial cocktail optimization (MACO) scheme is demonstrated for rapid screening of potent antibiotic cocktails using uropathogenic clinical isolates as model systems. With the MACO scheme, only 18 parallel trials were required to determin...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 2018
ISSN: 0191-2615
DOI: 10.1016/j.trb.2017.08.018